Entropic regularization of continuous optimal transport problems

نویسندگان

چکیده

We analyze continuous optimal transport problems in the so-called Kantorovich form, where we seek a plan between two marginals that are probability measures on compact subsets of Euclidean space. consider case regularization with negative entropy respect to Lebesgue measure, which has attracted attention because it can be solved by very simple Sinkhorn algorithm. first regularized problem context classical Fenchel duality and derive strong result for predual space functions. However, this may not admit minimizer, prevents obtaining primal-dual optimality conditions. then show primal is naturally analyzed Orlicz functions finite sense entropically admits minimizer if only have entropy. dual corresponding space, existence shown purely variational arguments conditions derived. For do entropy, finally Gamma-convergence smoothed original problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Continuous Min-Max Problems by an Iterative Entropic Regularization Method

We propose a method of outer approximations, with each approximate problem smoothed using entropic regularization, to solve continuous min-max problems. By using a well-known uniform error estimate for entropic regularization, convergence of the overall method is shown while allowing each smoothed problem to be solved inexactly. In the case of convex objective function and linear constraints, a...

متن کامل

Entropic Graph-based Posterior Regularization

Graph smoothness objectives have achieved great success in semi-supervised learning but have not yet been applied extensively to unsupervised generative models. We define a new class of entropic graph-based posterior regularizers that augment a probabilistic model by encouraging pairs of nearby variables in a regularization graph to have similar posterior distributions. We present a three-way a...

متن کامل

Entropic Regularization of the `0 function

Many problems of interest where more than one solution is possible seek, among these, the one that is sparsest. The objective that most directly accounts for sparsity, the `0 metric, is usually avoided since this leads to a combinatorial optimization problem. The function ‖x‖0 is often viewed as the limit of the `p. Naturally, there have been some attempts to use this as an objective for p smal...

متن کامل

Steiner problems in optimal transport

The problem of optimal transport, originally proposed by Monge, has a long history of investigation and application ([18] is an extensive reference). Roughly stated, the problem involves one who has an initial configuration of mass and would like to transport it to a terminal configuration of mass, doing so at least cost. For instance, one might have a set of water towers and a region of drough...

متن کامل

Entropic Graph-based Posterior Regularization: Extended Version

Graph smoothness objectives have achieved great success in semi-supervised learning but have not yet been applied extensively to unsupervised generative models. We define a new class of entropic graph-based posterior regularizers that augment a probabilistic model by encouraging pairs of nearby variables in a regularization graph to have similar posterior distributions. We present a three-way a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2021

ISSN: ['0022-247X', '1096-0813']

DOI: https://doi.org/10.1016/j.jmaa.2020.124432